a(s(x1)) → s(s(s(p(s(b(p(p(s(s(x1))))))))))
b(s(x1)) → s(s(s(p(p(s(s(c(p(s(p(s(x1))))))))))))
c(s(x1)) → p(s(p(s(a(p(s(p(s(x1)))))))))
p(p(s(x1))) → p(x1)
p(s(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
a(s(x1)) → s(s(s(p(s(b(p(p(s(s(x1))))))))))
b(s(x1)) → s(s(s(p(p(s(s(c(p(s(p(s(x1))))))))))))
c(s(x1)) → p(s(p(s(a(p(s(p(s(x1)))))))))
p(p(s(x1))) → p(x1)
p(s(x1)) → x1
P(p(s(x1))) → P(x1)
B(s(x1)) → P(s(p(s(x1))))
B(s(x1)) → P(s(s(c(p(s(p(s(x1))))))))
C(s(x1)) → P(s(x1))
A(s(x1)) → P(s(s(x1)))
B(s(x1)) → P(s(x1))
B(s(x1)) → P(p(s(s(c(p(s(p(s(x1)))))))))
C(s(x1)) → P(s(a(p(s(p(s(x1)))))))
A(s(x1)) → B(p(p(s(s(x1)))))
A(s(x1)) → P(p(s(s(x1))))
A(s(x1)) → P(s(b(p(p(s(s(x1)))))))
B(s(x1)) → C(p(s(p(s(x1)))))
C(s(x1)) → A(p(s(p(s(x1)))))
C(s(x1)) → P(s(p(s(x1))))
C(s(x1)) → P(s(p(s(a(p(s(p(s(x1)))))))))
a(s(x1)) → s(s(s(p(s(b(p(p(s(s(x1))))))))))
b(s(x1)) → s(s(s(p(p(s(s(c(p(s(p(s(x1))))))))))))
c(s(x1)) → p(s(p(s(a(p(s(p(s(x1)))))))))
p(p(s(x1))) → p(x1)
p(s(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
P(p(s(x1))) → P(x1)
B(s(x1)) → P(s(p(s(x1))))
B(s(x1)) → P(s(s(c(p(s(p(s(x1))))))))
C(s(x1)) → P(s(x1))
A(s(x1)) → P(s(s(x1)))
B(s(x1)) → P(s(x1))
B(s(x1)) → P(p(s(s(c(p(s(p(s(x1)))))))))
C(s(x1)) → P(s(a(p(s(p(s(x1)))))))
A(s(x1)) → B(p(p(s(s(x1)))))
A(s(x1)) → P(p(s(s(x1))))
A(s(x1)) → P(s(b(p(p(s(s(x1)))))))
B(s(x1)) → C(p(s(p(s(x1)))))
C(s(x1)) → A(p(s(p(s(x1)))))
C(s(x1)) → P(s(p(s(x1))))
C(s(x1)) → P(s(p(s(a(p(s(p(s(x1)))))))))
a(s(x1)) → s(s(s(p(s(b(p(p(s(s(x1))))))))))
b(s(x1)) → s(s(s(p(p(s(s(c(p(s(p(s(x1))))))))))))
c(s(x1)) → p(s(p(s(a(p(s(p(s(x1)))))))))
p(p(s(x1))) → p(x1)
p(s(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
P(p(s(x1))) → P(x1)
a(s(x1)) → s(s(s(p(s(b(p(p(s(s(x1))))))))))
b(s(x1)) → s(s(s(p(p(s(s(c(p(s(p(s(x1))))))))))))
c(s(x1)) → p(s(p(s(a(p(s(p(s(x1)))))))))
p(p(s(x1))) → p(x1)
p(s(x1)) → x1
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
P(p(s(x1))) → P(x1)
The value of delta used in the strict ordering is 2.
POL(P(x1)) = (4)x_1
POL(p(x1)) = 1/2 + (1/4)x_1
POL(s(x1)) = (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
a(s(x1)) → s(s(s(p(s(b(p(p(s(s(x1))))))))))
b(s(x1)) → s(s(s(p(p(s(s(c(p(s(p(s(x1))))))))))))
c(s(x1)) → p(s(p(s(a(p(s(p(s(x1)))))))))
p(p(s(x1))) → p(x1)
p(s(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
B(s(x1)) → C(p(s(p(s(x1)))))
C(s(x1)) → A(p(s(p(s(x1)))))
A(s(x1)) → B(p(p(s(s(x1)))))
a(s(x1)) → s(s(s(p(s(b(p(p(s(s(x1))))))))))
b(s(x1)) → s(s(s(p(p(s(s(c(p(s(p(s(x1))))))))))))
c(s(x1)) → p(s(p(s(a(p(s(p(s(x1)))))))))
p(p(s(x1))) → p(x1)
p(s(x1)) → x1
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(s(x1)) → B(p(p(s(s(x1)))))
Used ordering: Polynomial interpretation [25,35]:
B(s(x1)) → C(p(s(p(s(x1)))))
C(s(x1)) → A(p(s(p(s(x1)))))
The value of delta used in the strict ordering is 1/16.
POL(C(x1)) = (2)x_1
POL(B(x1)) = 1/4 + x_1
POL(A(x1)) = (2)x_1
POL(s(x1)) = 1/4 + (2)x_1
POL(p(x1)) = (1/2)x_1
p(p(s(x1))) → p(x1)
p(s(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
B(s(x1)) → C(p(s(p(s(x1)))))
C(s(x1)) → A(p(s(p(s(x1)))))
a(s(x1)) → s(s(s(p(s(b(p(p(s(s(x1))))))))))
b(s(x1)) → s(s(s(p(p(s(s(c(p(s(p(s(x1))))))))))))
c(s(x1)) → p(s(p(s(a(p(s(p(s(x1)))))))))
p(p(s(x1))) → p(x1)
p(s(x1)) → x1